package ink.lovejinhu.leetcode;

/**
 * @Author: jin
 * @Date: 2021/9/7 20:24
 * @Version: V1.0
 * @Slogan: Great people are not born great, but show their greatness in the process of growing up
 **/
public class Solution_0874 {
    /**
     * 机器人走的最远距离
     *
     * @param commands
     * @param obstacles
     * @return
     */
    public int robotSim(int[] commands, int[][] obstacles) {
        /**
         * flag=0  正北
         *     =-1   西
         *     =1    东
         *
         */
        int flag = 0;
        int x = 0, y = 0;
        for (int i = 0; i < commands.length; i++) {
            if (commands[i] == -1) {

            } else if (commands[i] == -2) {

            } else {

            }
        }
        return 0;
    }
}
